Graphs with cyclomatic number three having panconnected square, II
نویسندگان
چکیده
منابع مشابه
Semiharmonic graphs with fixed cyclomatic number
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c ≥ 2, there are at most finitely many trunks of semiharmonic graphs with cyclomatic number c — in contrast to the fact established by the last two of the present authors in their paper Semiharmonic Bicyclic Graphs (this journal) that there are infinitely many connected semiharmonic gr...
متن کاملHyperenergetic Graphs and Cyclomatic Number
AMS Mathematics Subject Classification (2000): 05C50
متن کاملPanconnected index of graphs
For a connected graph G not isomorphic to a path, a cycle or a K1,3, let pc(G) denote the smallest integer n such that the nth iterated line graph Ln(G) is panconnected. A path P is a divalent path of G if the internal vertices of P are of degree 2 in G. If every edge of P is a cut edge of G, then P is a bridge divalent path of G; if the two ends of P are of degree s and t , respectively, then ...
متن کاملPacking edge-disjoint cycles in graphs and the cyclomatic number
For a graph G let μ(G) denote the cyclomatic number and let ν(G) denote the maximum number of edge-disjoint cycles of G. We prove that for every k ≥ 0 there is a finite set P(k) such that every 2-connected graph G for which μ(G)− ν(G) = k arises by applying a simple extension rule to a graph in P(k). Furthermore, we determine P(k) for k ≤ 2 exactly.
متن کاملThe cyclomatic number of connected graphs without solvable orbits
We study the combinatorics of constructing non-singular geometrically irreducible projective curves that do not admit rational points over finite solvable extensions of the base field. A graph is without solvable orbits if its group of automorphisms acts on each of its orbits through a non-solvable quotient. We prove that there is a connected graph without solvable orbits of cyclomatic number c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2020
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2020.02.002